Quantum Search Algorithms for Wireless Communications

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flexible signal processing algorithms for wireless communications

Wireless communications systems of the future will experience more dynamic channel conditions and a wider range of application requirements than systems of today. Such systems will require exible signal processing algorithms that can exploit wireless channel conditions and knowledge of end-to-end user requirements to provide e cient communications services. In this thesis, we investigate wirele...

متن کامل

Nonadiabatic quantum search algorithms

We present two continuous-time quantum search algorithms similar to the adiabatic search algorithm, but now without the requirement of adiabatic evolution. Both algorithms can find the marked state in a time proportional to N. The behavior of the first algorithm is, essentially, similar to Grover’s algorithm, but the second model possesses the important property that one does not need to single...

متن کامل

Local search algorithms for wireless mesh networks

Abstract. In a multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (Mobile Computing and Communications Review 2004, INFOCOM 2005) propose and study several such architectures in which a computer can have multiple network interface cards. These architectures are modeled as a graph problem named maximum edge q-coloring...

متن کامل

Power Control Algorithms in Wireless Communications

Power control in cellular systems is applied to numerous communication architectures. For Frequency Division Multiple Access (FDMA) and Time Division Multiple Access (TDMA) power control reduces intercell interference and improves capacity. For Code Division Multiple Access (CDMA) power control is a required part of the base station and mobile station designs. Power Control reduces interference...

متن کامل

Quantum Algorithms for Highly Structured Search Problems

We consider the problem of identifying a base k string given an oracle which returns information about the number of correct components in a query, specifically, the Hamming distance between the query and the solution, modulo r = max{2, 6 − k}. Classically this problem requires Ω(n logr k) queries. For k ∈ {2, 3, 4} we construct quantum algorithms requiring only a single quantum query. For k > ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Communications Surveys & Tutorials

سال: 2019

ISSN: 1553-877X,2373-745X

DOI: 10.1109/comst.2018.2882385